Cat Swarm Optimization Algorithm For Antenna Array Synthesis
نویسندگان
چکیده
منابع مشابه
Digitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms
This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...
متن کاملThinned Elliptical Cylindrical Antenna Array Synthesis Using Particle Swarm Optimization
This paper describes optimal thinning of an Elliptical Cylindrical Array (ECA) of uniformly excited isotropic antennas which can generate directive beam with minimum relative Side Lobe Level (SLL). The Particle Swarm Optimization (PSO) method, which represents a new approach for optimization problems in electromagnetic, is used in the optimization process. The PSO is used to determine the optim...
متن کاملCat swarm optimization clustering (KSACSOC): A cat swarm optimization clustering algorithm
Clustering is an unsupervised process that divides a given set of objects into groups so that objects within a cluster are highly similar with one another and dissimilar with the objects in other clusters. In this article, a new clustering method based on cat swarm optimization was proposed to find the proper clustering of data sets called K-means improvement and Simulated Annealing selection b...
متن کاملCat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کاملAntenna array pattern synthesis via convex optimization
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great eeciency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near eld patterns over narrow or broad frequency bandwidth, and some i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Turkish Journal of Computer and Mathematics Education (TURCOMAT)
سال: 2021
ISSN: 1309-4653
DOI: 10.17762/turcomat.v12i2.1375